Embedding countable rings in $2$-generator rings
نویسندگان
چکیده
منابع مشابه
Countable Exchange and Full Exchange Rings
We show that a Dedekind-finite, semi-π-regular ring with a “nice” topology is an א0-exchange ring, and the same holds true for a strongly clean ring with a “nice” topology. We generalize the argument to show that a Dedekind-finite, semi-regular ring with a “nice” topology is a full exchange ring. Putting these results in the language of modules, we show that a cohopfian module with finite excha...
متن کاملAn Automatic Glyco-Workflow Generator in RINGS
Recently, databases of glycans have increased in the bioinformatics field. RINGS [1] is a resource that requires a comprehensive glycan database such that the glycobiologist can freely use glycan analysis tools with convenience. RINGS contains utility tools, most of which are conversion utilities for different glycan file formats. For example, there are the conversion tools that convert KEGG Gl...
متن کاملComputing generator in cyclotomic integer rings
The Principal Ideal Problem (resp. Short Principal Ideal Problem), shorten as PIP (resp. SPIP), consists in finding a generator (resp. short generator) of a principal ideal in the ring of integers of a number field. Several lattice-based cryptosystems rely on the presumed hardness of these two problems. In practice, most of them do not use an arbitrary number field but a power-of-two cyclotomic...
متن کامل. R A ] 2 2 N ov 2 00 4 BRANCH RINGS , THINNED RINGS , TREE ENVELOPING RINGS
We develop the theory of “branch algebras”, which are infinitedimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting on trees. In particular, for every field k we construct a k-algebra K which • is finitely generated and infinite-dimensional, but has only finite-dimensional qu...
متن کاملEmbedding Hypercubes onto Rings and Toruses
Many parallel algorithms use hypercubes as the communication topology among processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fact tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1987
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1987-0883394-6